A fast quantum algorithm for the affine Boolean function identification
نویسندگان
چکیده
منابع مشابه
Efficient Algorithm of Affine Form Searching forWeakly Specified Boolean Function
This paper presents the spectral method of recognition of an incompletely defined Boolean function. The main goal of analysis is fast estimation whether a given single output function can be extended to affine form. Furthermore, a simple extension algorithm is proposed for functions, for which the affine form is reachable. The algorithm is compared with other methods. Theoretical and experiment...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe fast affine projection algorithm
This paper discusses a new adaptive filtering algorithm called fast affine projections (FAP). FAP’s key features include LMS like complexity and memory requirements (low), and RLS like convergence (fast) for the important case where the excitation signal is speech. Another of FAP’s important features is that it causes no delay in the input or output signals. In addition, the algorithm is easily...
متن کاملQuantum algorithm to check Resiliency of a Boolean function ( Extended
In this paper, for the first time, we present quantum algorithms to check the order of resiliency of a Boolean function. We first show that the DeutschJozsa algorithm can be directly used for this purpose. We also point out how the quadratic improvement in query complexity over the Deutsch-Jozsa algorithm can be obtained using the well known Grover’s algorithm. While the worst case quantum quer...
متن کاملQuantum algorithm to check Resiliency of a Boolean function
In this paper, for the first time, we present quantum algorithms to check the order of resiliency of a Boolean function. We first show that the DeutschJozsa algorithm can be directly used for this purpose. We also point out how the quadratic improvement in query complexity over the Deutsch-Jozsa algorithm can be obtained using the well known Grover’s algorithm. While the worst case quantum quer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal Plus
سال: 2015
ISSN: 2190-5444
DOI: 10.1140/epjp/i2015-15034-4